NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
نویسندگان
چکیده
NCSOStools is a Matlab toolbox for • symbolic computation with polynomials in noncommuting variables; • constructing and solving sum of hermitian squares (with commutators) programs for polynomials in noncommuting variables. It can be used in combination with semidefinite programming software, such as SeDuMi, SDPA or SDPT3 to solve these constructed programs. This paper provides an overview of the theoretical underpinning of these sum of hermitian squares (with commutators) programs, and provides a gentle introduction to the primary features of NCSOStools.
منابع مشابه
Rational Sums of Hermitian Squares of Free Noncommutative Polynomials
In this paper we consider polynomials in noncommuting variables that admit sum of hermitian squares and commutators decompositions. We recall algorithms for finding decompositions of this type that are based on semidefinite programming. The main part of the article investigates how to find such decomposition with rational coefficients if the original polynomial has rational coefficients. We sho...
متن کاملConstrained Polynomial Optimization Problems with Noncommuting Variables
In this paper we study constrained eigenvalue optimization of noncommutative (nc) polynomials, focusing on the polydisc and the ball. Our three main results are as follows: (1) an nc polynomial is nonnegative if and only if it admits a weighted sum of hermitian squares decomposition; (2) (eigenvalue) optima for nc polynomials can be computed using a single semidefinite program (SDP) – this shar...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملConstrained trace-optimization of polynomials in freely noncommuting variables
The study of matrix inequalities in a dimension-free setting is in the realm of free real algebraic geometry (RAG). In this paper we investigate constrained trace and eigenvalue optimization of noncommutative polynomials. We present Lasserre’s relaxation scheme for trace optimization based on semidefinite programming (SDP) and demonstrate its convergence properties. Finite convergence of this r...
متن کاملMaking Computer Algebra More Symbolic
This paper is a step to bring closer together two views of computing with mathematical objects: the view of “symbolic computation” and the view of “computer algebra.” Symbolic computation may be seen as working with expression trees representing mathematical formulae and applying various rules to transform them. Computer algebra may be seen as developing constructive algorithms to compute algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Methods and Software
دوره 26 شماره
صفحات -
تاریخ انتشار 2011